The algebra of metric betweenness I: Subdirect representation and retraction
نویسندگان
چکیده
منابع مشابه
The algebra of metric betweenness I: Subdirect representation and retraction
We bring together algebraic concepts such as equational class and various concepts from graph theory for developing a structure theory for graphs that promotes a deeper analysis of their metric properties. The basic operators are Cartesian multiplication and gated amalgamation or, alternatively, retraction. Specifically, finite weakly median graphs are known to be decomposable (relative to thes...
متن کاملNullstellen and Subdirect Representation
David Hilbert’s solvability criterion for polynomial systems in n variables from the 1890s was linked by Emmy Noether in the 1920s to the decomposition of ideals in commutative rings, which in turn led Garret Birkhoff in the 1940s to his subdirect representation theorem for general algebras. The Hilbert-NoetherBirkhoff linkage was brought to light in the late 1990s in talks by Bill Lawvere. The...
متن کاملheterogeneity within the orientalist discourse: representation of the orient in womens travelogues and mens paintings
from 1950s onward, new theories and critical approaches burgeoned across humanities. these theories were context-oriented; as a result, the analysis of discursive practices gained significance. thus, social, political, historical and cultural discourses that have been hitherto marginalized and considered inferior to literary texts, were introduced as important texts to be analyzed by critics. o...
Subdirect Unions in Universal Algebra
The number of distinct operations (that is, the range of the variable a) may be infinite, but for our main result (Theorem 2), we shall require every n(a) to be finite—that is, it will concern algebras with finitary operations. The concepts of subalgebra, congruence relation on an algebra, homomorphism of one algebra A onto (or into) another algebra with the same operations, and of the direct u...
متن کاملThe algebra of metric betweenness II: Geometry and equational characterization of weakly median graphs
We elaborate on the convexity properties of (not necessarily finite) weakly median graphs and their prime constituents in order to establish a number of equations in terms of the weakly median operation. Then the weakly median graphs can be identified with the discrete members of an equational class of ternary algebras satisfying five independent axioms on two to four points. This demonstrates ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2007
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2006.07.003